全文获取类型
收费全文 | 3609篇 |
免费 | 138篇 |
国内免费 | 126篇 |
专业分类
化学 | 200篇 |
晶体学 | 4篇 |
力学 | 178篇 |
综合类 | 49篇 |
数学 | 3079篇 |
物理学 | 363篇 |
出版年
2024年 | 2篇 |
2023年 | 34篇 |
2022年 | 44篇 |
2021年 | 59篇 |
2020年 | 61篇 |
2019年 | 56篇 |
2018年 | 54篇 |
2017年 | 50篇 |
2016年 | 62篇 |
2015年 | 60篇 |
2014年 | 106篇 |
2013年 | 185篇 |
2012年 | 149篇 |
2011年 | 153篇 |
2010年 | 156篇 |
2009年 | 244篇 |
2008年 | 268篇 |
2007年 | 302篇 |
2006年 | 241篇 |
2005年 | 172篇 |
2004年 | 139篇 |
2003年 | 135篇 |
2002年 | 146篇 |
2001年 | 116篇 |
2000年 | 109篇 |
1999年 | 98篇 |
1998年 | 103篇 |
1997年 | 79篇 |
1996年 | 66篇 |
1995年 | 53篇 |
1994年 | 52篇 |
1993年 | 42篇 |
1992年 | 31篇 |
1991年 | 27篇 |
1990年 | 19篇 |
1989年 | 26篇 |
1988年 | 25篇 |
1987年 | 13篇 |
1986年 | 17篇 |
1985年 | 21篇 |
1984年 | 22篇 |
1983年 | 4篇 |
1982年 | 16篇 |
1981年 | 10篇 |
1980年 | 9篇 |
1979年 | 8篇 |
1978年 | 11篇 |
1977年 | 7篇 |
1976年 | 6篇 |
1975年 | 2篇 |
排序方式: 共有3873条查询结果,搜索用时 15 毫秒
1.
2.
A new family of proximity graphs: Class cover catch digraphs 总被引:1,自引:0,他引:1
Jason DeVinney 《Discrete Applied Mathematics》2006,154(14):1975-1982
Motivated by issues in machine learning and statistical pattern classification, we investigate a class cover problem (CCP) with an associated family of directed graphs—class cover catch digraphs (CCCDs). CCCDs are a special case of catch digraphs. Solving the underlying CCP is equivalent to finding a smallest cardinality dominating set for the associated CCCD, which in turn provides regularization for statistical pattern classification. Some relevant properties of CCCDs are studied and a characterization of a family of CCCDs is given. 相似文献
3.
首先在Contingent切锥意义下界定了Banach空间中非空集合的伪切锥和伪凸性的概念,并讨论了相应的性质,然后针对可微优化问题,在广义凸性假设下,建立了最优性条件。 相似文献
4.
Fabio Schoen 《Journal of Global Optimization》1991,1(3):207-228
In this paper stochastic algorithms for global optimization are reviewed. After a brief introduction on random-search techniques, a more detailed analysis is carried out on the application of simulated annealing to continuous global optimization. The aim of such an analysis is mainly that of presenting recent papers on the subject, which have received only scarce attention in the most recent published surveys. Finally a very brief presentation of clustering techniques is given. 相似文献
5.
Vivek F. Farias 《Operations Research Letters》2006,34(2):180-190
We consider a problem of allocating limited quantities of M types of resources among N independent activities that evolve over T epochs. In each epoch, we assign to each activity a task which consumes resources, generates utility, and determines the subsequent state of the activity. We study the complexity of, and approximation algorithms for, maximizing average utility. 相似文献
6.
Dual fractional cutting plane algorithms, in which cutting planes are used to iteratively tighten a linear relaxation of an integer program,
are well-known and form the basis of the highly successful branch-and-cut method. It is rather less well-known that various primal cutting plane algorithms were developed in the 1960s, for example by Young. In a primal algorithm, the main role of the cutting
planes is to enable a feasible solution to the original problem to be improved. Research on these algorithms has been almost
non-existent.
In this paper we argue for a re-examination of these primal methods. We describe a new primal algorithm for pure 0-1 problems based on strong valid inequalities and give some encouraging computational results. Possible extensions to the case of general
mixed-integer programs are also discussed. 相似文献
7.
Evolutionary algorithms are applied as problem-independent optimization algorithms. They are quite efficient in many situations. However, it is difficult to analyze even the behavior of simple variants of evolutionary algorithms like the (1+1) EA on rather simple functions. Nevertheless, only the analysis of the expected run time and the success probability within a given number of steps can guide the choice of the free parameters of the algorithms. Here static (1+1) EAs with a fixed mutation probability are compared with dynamic (1+1) EAs with a simple schedule for the variation of the mutation probability. The dynamic variant is first analyzed for functions typically chosen as example-functions for evolutionary algorithms. Afterwards, it is shown that it can be essential to choose the suitable variant of the (1+1) EA. More precisely, functions are presented where each static (1+1) EA has exponential expected run time while the dynamic variant has polynomial expected run time. For other functions it is shown that the dynamic (1+1) EA has exponential expected run time while a static (1+1) EA with a good choice of the mutation probability has polynomial run time with overwhelming probability. 相似文献
8.
The Boltzmann distribution used in the steady-state analysis of the simulated annealing algorithm gives rise to several scale invariant properties. Scale invariance is first presented in the context of parallel independent processors and then extended to an abstract form based on lumping states together to form new aggregate states. These lumped or aggregate states possess all of the mathematical characteristics, forms and relationships of states (solutions) in the original problem in both first and second moments. These scale invariance properties therefore permit new ways of relating objective function values, conditional expectation values, stationary probabilities, rates of change of stationary probabilities and conditional variances. Such properties therefore provide potential applications in analysis, statistical inference and optimization. Directions for future research that take advantage of scale invariance are also discussed. 相似文献
9.
A (w,r) cover‐free family is a family of subsets of a finite set such that no intersection of w members of the family is covered by a union of r others. A (w,r) superimposed code is the incidence matrix of such a family. Such a family also arises in cryptography as the concept of key distribution pattern. In the present paper, we give some new results on superimposed codes. First we construct superimposed codes from super‐simple designs which give us results better than superimposed codes constructed by other known methods. Next we prove the uniqueness of the (1,2) superimposed code of size 9 × 12, the (2,2) superimposed code of size 14 × 8, and the (2,3) superimposed code of size 30 × 10. Finally, we improve numerical values of upper bounds for the asymptotic rate of some (w,r) superimposed codes. © 2004 Wiley Periodicals, Inc. 相似文献
10.
Tor Schoenmeyr David Yu Zhang 《Journal of Algorithms in Cognition, Informatics and Logic》2005,57(2):130-139
The string matching with mismatches problem requires finding the Hamming distance between a pattern P of length m and every length m substring of text T with length n. Fischer and Paterson's FFT-based algorithm solves the problem without error in O(σnlogm), where σ is the size of the alphabet Σ [SIAM–AMS Proc. 7 (1973) 113–125]. However, this in the worst case reduces to O(nmlogm). Atallah, Chyzak and Dumas used the idea of randomly mapping the letters of the alphabet to complex roots of unity to estimate the score vector in time O(nlogm) [Algorithmica 29 (2001) 468–486]. We show that the algorithm's score variance can be substantially lowered by using a bijective mapping, and specifically to zero in the case of binary and ternary alphabets. This result is extended via alphabet remappings to deterministically solve the string matching with mismatches problem with a constant factor of 2 improvement over Fischer–Paterson's method. 相似文献